翻訳と辞書 Words near each other ・ Random-access machine ・ Random-access memory ・ Random-access stored-program machine ・ Random-access Turing machine ・ Random.org ・ Randomajestiq ・ Randominta ・ Randomization ・ Randomization function ・ Randomized algorithm ・ Randomized algorithms as zero-sum games ・ Randomized block design ・ Randomized controlled trial ・ Randomized experiment ・ Randomized Hough transform ・ Randomized meldable heap ・ Randomized response ・ Randomized rounding ・ Randomized weighted majority algorithm ・ Randomness ・ Randomness extractor ・ Randomness merger ・ Randomness tests ・ Random—Burin—St. George's ・ Randon ・ Randonnai ・ Randonneuring ・ Randonneurs USA ・ Randonnée ・ Randoon Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Randomized meldable heap ： ウィキペディア英語版 Randomized meldable heap In computer science, a randomized meldable heap (also Meldable Heap or Randomized Meldable Priority Queue) is a priority queue based data structure in which the underlying structure is also a heap-ordered binary tree. However, there are no restrictions on the shape of the underlying binary tree. This approach has a number of advantages over similar data structures. It offers greater simplicity: all operations for the randomized meldable heap are easy to implement and the constant factors in their complexity bounds are small. There is also no need to preserve balance conditions and no satellite information within the nodes is necessary. Lastly, this structure has good worst-case time efficiency. The execution time of each individual operation is at most logarithmic with high probability.〔A. Gambin and A. Malinowski. 1998. Randomized Meldable Priority Queues. In Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics (SOFSEM '98), Branislav Rovan (Ed.). Springer-Verlag, London, UK, UK, 344-349.〕 ==Operations== The randomized meldable heap supports a number of common operations. These are insertion, deletion, and a searching operation, findMin. The insertion and deletion operations are implemented in terms of an additional operation specific to the meldable heap, Meld(Q1, Q2). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Randomized meldable heap」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.